Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts
نویسندگان
چکیده
We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.
منابع مشابه
Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
A relative reduct can be considered as a minimum set of attributes that preserves a certain classification property. This paper investigates three different classification properties, and suggests three distinct definitions accordingly. In the Pawlak rough set model, while the three definitions yield the same set of relative reducts in consistent decision tables, they may result in different se...
متن کاملData analysis based on discernibility and indiscernibility
Rough set theory models similarities and differences of objects based on the notions of indiscernibility and discernibility. With respect to any subset of attributes, one can define two pairs of dual relations: the strong indiscernibility and weak discernibility relations, and the weak indiscernibility and strong discernibility relations. The similarities of objects are examined by the indiscer...
متن کاملRough Set Approach to Information Tables with Imprecise Decisions
In this paper, we treat information tables with imprecise decisions, for short, imprecise decision tables. In the imprecise decision tables, decision attribute values are specified imprecisely. Under such decision tables, lower and upper object sets for a set of decision attribute values are defined. Their properties are shown. Concepts of reducts of imprecise decision tables are studied. Disce...
متن کاملDecision-relative discernibility matrices in the sense of entropies
In rough set theory, attribute reduction is a basic issue, which aims to hold the discernibility of the attribute set. To obtain all of the reducts of an information system or a decision table, researchers have introduced many discernibility matrixes based reduction methods. However, the reducts in the sense of positive region can only be obtained by using the existing discernibility matrixes. ...
متن کاملQuick attribute reduction in inconsistent decision tables
This paper focuses on three types of attribute reducts in inconsistent decision tables: assignment reduct, distribution reduct, and maximum distribution reduct. It is quite inconvenient to judge these three types of reduct directly according to their definitions. This paper proposes judgment theorems for the assignment reduct, the distribution reduct and the maximum distribution reduct, which a...
متن کامل